Halman, Nir: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle

Halman, Nir, Orlin, James B., Simchi-Levi, David

Journal:

Operations Research

Year:

2012

Language:

english

File:

PDF, 344 KB

english, 2012

2

Discrete and Lexicographic Helly-Type Theorems

Journal:

Discrete & Computational Geometry

Year:

2008

Language:

english

File:

PDF, 568 KB

english, 2008

3

An FPTAS for the knapsack problem with parametric weights

Halman, Nir, Holzhauser, Michael, Krumke, Sven O.

Journal:

Operations Research Letters

Year:

2018

Language:

english

File:

PDF, 360 KB

english, 2018

4

One-way and round-trip center location problems

Arie Tamir, Nir Halman

Journal:

Discrete Optimization

Year:

2005

Language:

english

File:

PDF, 304 KB

english, 2005

5

Fully polynomial-time approximation schemes for time–cost tradeoff problems in series–parallel project networks

Nir Halman, Chung-Lun Li, David Simchi-Levi

Journal:

Operations Research Letters

Year:

2009

Language:

english

File:

PDF, 1.15 MB

english, 2009

6

Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems

Journal:

Year:

2007

Language:

english

File:

PDF, 222 KB

english, 2007

7

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Halman, Nir, Klabjan, Diego, Mostagir, Mohamed, Orlin, Jim, Simchi-Levi, David

Journal:

Mathematics of Operations Research

Year:

2009

Language:

english

File:

PDF, 210 KB

english, 2009

8

Bi-criteria path problem with minimum length and maximum survival probability

Halman, Nir, Kovalyov, Mikhail Y., Quilliot, Alain, Shabtay, Dvir, Zofi, Moshe

Journal:

Year:

2018

Language:

english

File:

PDF, 526 KB

english, 2018

9

Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs

Journal:

INFORMS Journal on Computing

Year:

2020

File:

PDF, 950 KB

2020

10

The TV advertisements scheduling problem

Díaz-Núñez, Fabián, Halman, Nir, Vásquez, Óscar C.

Journal:

Optimization Letters

Year:

2018

Language:

english

File:

PDF, 527 KB

english, 2018

11

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy

Journal:

Theoretical Computer Science

Year:

2016

Language:

english

File:

PDF, 305 KB

english, 2016

12

A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand

Orlin, James B., Halman, Nir, Klabjan, Diego, Mostagir, Mohamed, Simchi-Levi, David

Journal:

SSRN Electronic Journal

Year:

2006

Language:

english

File:

PDF, 380 KB

english, 2006

13

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs

Halman, Nir, Klabjan, Diego, Li, Chung-Lun, Orlin, James, Simchi-Levi, David

Journal:

SIAM Journal on Discrete Mathematics

Year:

2014

Language:

english

File:

PDF, 950 KB

english, 2014

14

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Nir Halman, Diego Klabjan, Mohamed Mostagir, Jim Orlin and David Simchi-Levi

Journal:

Mathematics of Operations Research

Year:

2009

Language:

english

File:

PDF, 1.45 MB

english, 2009

15

On the complexity of energy storage problems

Halman, Nir, Nannicini, Giacomo, Orlin, James

Journal:

Discrete Optimization

Year:

2017

Language:

english

File:

PDF, 861 KB

english, 2017

16

On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model

Journal:

SIAM Journal on Computing

Year:

2008

Language:

english

File:

PDF, 468 KB

english, 2008

17

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs

Halman, Nir, Nannicini, Giacomo, Orlin, James

Journal:

SIAM Journal on Optimization

Year:

2015

Language:

english

File:

PDF, 428 KB

english, 2015

18

A faster FPTAS for counting two-rowed contingency tables

Alon, Tzvi, Halman, Nir

Journal:

Discrete Applied Mathematics

Year:

2020

File:

PDF, 419 KB

2020

19

Approximation Schemes for Non-Separable Non-Linear Boolean Programming Problems under Nested Knapsack Constraints

Halman, Nir, Kellerer, Hans, Strusevich, Vitaly A.

Journal:

European Journal of Operational Research

Year:

2018

Language:

english

File:

PDF, 926 KB

english, 2018

20

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Journal:

Information Processing Letters

Year:

2003

Language:

english

File:

PDF, 128 KB

english, 2003

21

Approximating convex functions via non-convex oracles under the relative noise model

Journal:

Discrete Optimization

Year:

2015

Language:

english

File:

PDF, 540 KB

english, 2015

22

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Journal:

Journal of Scheduling

Year:

2019

Language:

english

File:

PDF, 287 KB

english, 2019

23

The convex dimension of a graph

Nir Halman, Shmuel Onn, Uriel G. Rothblum

Journal:

Discrete Applied Mathematics

Year:

2007

Language:

english

File:

PDF, 215 KB

english, 2007

24

Continuous bottleneck tree partitioning problems

Nir Halman, Arie Tamir

Journal:

Discrete Applied Mathematics

Year:

2004

Language:

english

File:

PDF, 305 KB

english, 2004

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски